Fast constant-time gcd computation and modular inversion
نویسندگان
چکیده
منابع مشابه
Fast and Constant-Time Implementation of Modular Exponentiation
Modular exponentiation is an important operation which requires a vast amount of computations. Therefore, it is crucial to build fast exponentiation schemes. Since Cache and data-dependent branching behavior can alter the runtime of an algorithm significantly, it is also important to build an exponentiation scheme with constant run-time. However, such approaches have traditionally added signifi...
متن کاملMonotone and fast computation of Euler’s constant
We construct sequences of finite sums [Formula: see text] and [Formula: see text] converging increasingly and decreasingly, respectively, to the Euler-Mascheroni constant γ at the geometric rate 1/2. Such sequences are easy to compute and satisfy complete monotonicity-type properties. As a consequence, we obtain an infinite product representation for [Formula: see text] converging in a monotone...
متن کاملAlgebraic Factorization and GCD Computation
This chapter describes several algorithms for factorization and GCD computation of polynomials over algebraic extension fields. These algorithms are common in using the characteristic set method introduced in the previous chapters. Some performance comparisons between these algorithms are reported. Applications include geometry theorem proving, irreducible decomposition of algebraic variaities,...
متن کاملA modular integer GCD algorithm
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U , V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC ’93: International Symposium on Symbolic and Algebr...
متن کاملOptimizing and Parallelizing Brown’s Modular GCD Algorithm
Consider the multivariate polynomial problem over the integers; that is, Gcd(A,B) where A,B ∈ Z[x1, x2, . . . xn]. We can solve this problem by solving the related Gcd problem in Zp[x1, x2, . . . xn] for several primes p, and then reconstructing the solution in the integers using Chinese Remaindering. The question we address in this paper is how fast can we solve the problem Gcd(A,B) in Zp[x1, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Cryptographic Hardware and Embedded Systems
سال: 2019
ISSN: 2569-2925
DOI: 10.46586/tches.v2019.i3.340-398